Terrain Visibility with Multiple Viewpoints
نویسندگان
چکیده
We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility map. We study the complexity of each structure for both 1.5D and 2.5D terrains, and provide efficient algorithms to construct them. Our algorithm for the visibility map in 2.5D terrains improves on the only existing algorithm in this setting.
منابع مشابه
Intervisibility on Terrains
Many interesting application problems on terrains involve visibility computations; for example, the search for optimal locations of observation points, line-of-sight communication problems, and the computation of hidden or scenic paths. The solution of such problems needs techniques to answer visibility queries on a terrain eeciently, and/or the development of data structures encoding the visib...
متن کاملA faster algorithm to compute the visibility map of a 1.5D terrain
Given a 1.5D terrain, i.e., an x-monotone polygonal line in R with n vertices, and 1 ≤ m ≤ n viewpoints placed on some of the terrain vertices, we study the problem of computing the parts of the terrain that are visible from at least one of the viewpoints. We present an algorithm that runs in O(n+m logm) time. This improves over a previous algorithm recently proposed.
متن کاملAlgorithms for visibility computation on terrains: a survey
Several environment applications require the computation of visibility information on a terrain. Examples are optimal placement of observation points, line-of-sight communication, and computation of hidden as well as scenic paths. Visibility computations on a terrain may involve either one or many viewpoints, and range from visibility queries (for example, testing whether a given query point is...
متن کاملOptimising Visibility Analyses Using Topographic Features on the Terrain
The advantages of using the fundamental topographic features of a surface namely the peaks, pits, passes, ridges and channels as the observers (viewpoints) in visibility computation is presented. Considerable time can be saved without any significant information loss by using the fundamental topographic features as observers in the terrain. This optimisation is achieved because of a reduced num...
متن کاملOn reduced time fault tolerant paths for multiple UAVs covering a hostile terrain
We present a method for finding reduced time coverage paths of multiple UAVs (Unmanned Air Vehicles) monitoring a 3D terrain represented as height fields. A novel metric based on per time visibility is used that couples visibility gained at a terrain point with the time spent to reach the point. This coupled metric is utilized to form reduced time paths by maximizing the visibility gained per u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 24 شماره
صفحات -
تاریخ انتشار 2013